STRIPStream: Integrating Symbolic Planners and Blackbox Samplers
نویسندگان
چکیده
Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, and motion constraints involving robot configurations, object transforms, and robot trajectories. These constraints typically require specialized procedures to sample satisfying values. We extend the STRIPS planning language to support a generic, declarative specification for these procedures while treating their implementation as blackboxes. We provide several domain-independent algorithms that reduce STRIPStream problems to a sequence of finite-domain STRIPS planning problems. Additionally, we describe cost-sensitive planning within this framework. Finally, we evaluate our algorithms on three robotic task and motion planning domains.
منابع مشابه
STRIPS Planning in Infinite Domains
Many robotic planning applications involve continuous actions with highly non-linear constraints, which cannot be modeled using modern planners that construct a propositional representation. We introduce STRIPStream: an extension of the STRIPS language which can model these domains by supporting the specification of blackbox generators to handle complex constraints. The outputs of these generat...
متن کاملDesigning a Conceptual Framework for Integrating Components of Professional Ethics in a Ceramic Curriculum
Background: Teaching professional ethics in the ceramics branch requires using a standard system of integrating professional ethics components in the ceramics curriculum elements to determine the relationship between professional ethics and the curriculum components. The aim of the present study is a conceptual framework for integrating the elements of professional ethics in the ceramic’s curri...
متن کاملA Unified Search Framework for Large-scale Black-box Optimization
The parameter configuration of a network protocol can be formulated as a black-box optimization problem with network simulation evaluating the performance of the blackbox, i.e., the network. This paper proposes a unified search framework (USF) to handle such large-scale black-box optimization problems. The framework is designed to provides a general platform on which tailored optimization algor...
متن کاملAn Evaluation of Blackbox Graph Planning
In this paper, we investigate a satisfiability-based approach to solving STRIPS planning problems. Traditionally, popular algorithms for STRIPS planning problems include a stable of total-order planners, such as Prodigy, and partial-order planners, such as UCPOP. Blum and Furst introduced a novel way of constructing solutions for these problems called Graphplan, which significantly outperformed...
متن کاملSHOP: Simple Hierarchical Ordered Planner
SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.08705 شماره
صفحات -
تاریخ انتشار 2018